A Domain Consistency Algorithm for the Stretch Constraint
نویسندگان
چکیده
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consistency propagation of the stretch constraint. Using benchmark and random instances, we show that this stronger consistency sometimes enables our propagator to solve more difficult problems than a previously proposed propagation algorithm for the stretch constraint. We also discuss variations of the stretch constraint that seem simple and useful, but turn out to be intractable to fully propagate.
منابع مشابه
Consistency Propagation for Stretch Constraints
Scheduling and rostering problems are among the most common applications of constraint programming. In this thesis, we explore several global constraints for rostering problems. We demonstrate algorithms for efficiently enforcing domain consistency for these constraints, and show empirically that achieving this strongest possible level of consistency is not only of theoretical interest, but als...
متن کاملExplanations for global constraints: instrumenting the stretch constraint
This article presents an extension of the stretch constraint for explanationbased solvers and algorithms. This extension implies the computation of precise explanations in order to justify all the decisions the filtering algorithm makes: value removals, domain reductions or contradiction. Experiments show a distinct improvement when using explanations to improve search.
متن کاملA simulation study of calcium release channel
The IP3R calcium release channel has been simulated using a stochastic simulation algorithm (SSA;Gillespie algorithm) and De young-Keiser model. A set of different concentration for Cat' and IP3 havebeen used. Considering the Number of molecules in each state, a non linear behavior of the system can beseen clearly. The inhibiting role of the Ca+2 on the open state (X110) has been studied. The d...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملProgramming finite-domain constraint propagators in Action Rules
In this paper, we propose a new language construct, called AR (Action Rules), and describe how various propagators for finite-domain constraints can be implemented in it. An action rule specifies a pattern for agents, an action that the agents can carry out, and an event pattern for events that can activate the agents. AR combines the goal-oriented execution model of logic programming with the ...
متن کامل